Shape-wilf-equivalences for Vincular Patterns
نویسنده
چکیده
We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as “generalized patterns” or “dashed patterns”). First we introduce a stronger equivalence on patterns which we call filling-shape-Wilfequivalence. When vincular patterns α and β are filling-shape-Wilf-equivalent, we prove that α⊕ σ and β ⊕ σ must also be filling-shape-Wilf-equivalent. We also discover two new pairs of patterns which are filling-shape-Wilf-equivalent: when α, β, and σ are nonempty consecutive patterns which are Wilf-equivalent, α⊕σ is filling-shape-Wilf-equivalent to β⊕σ; and for any consecutive pattern α, 1⊕α is filling-shape-Wilf-equivalent to 1 α. These new equivalences imply many new Wilf-equivalences for vincular patterns.
منابع مشابه
Some Wilf-equivalences for Vincular Patterns
We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating functions for the number of permutations of length n avoiding σ for the patterns 124-3, 134-2, 231-4, 241-3, 132-4, and 142-3. This nearly completes the Wilfclassification of vincular patterns of length ...
متن کاملNew Equivalences for Pattern Avoiding Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for involutions.
متن کاملNew Equivalences for Pattern Avoidance for Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for both permutations and involut...
متن کاملEnumeration schemes for vincular patterns
We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called “generalized patterns” or “dashed patterns”). In particular we provide an algorithm which takes in as input a set B of vincular patterns and search parameters and returns a recurrence (called a “scheme”) to compute the number of permutations of length n avoiding B or co...
متن کاملJ un 2 01 7 Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length
Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of permutations simultaneously avoiding a vincular and a covincular pattern, both of length 3, with at most one restriction. We see familiar sequences, such as the ...
متن کامل